runtime.mspan.elemsize (field)

95 uses

	runtime (current package)
		arena.go#L780: 		racemalloc(unsafe.Pointer(span.base()), span.elemsize)
		arena.go#L785: 		msanmalloc(unsafe.Pointer(span.base()), span.elemsize)
		arena.go#L791: 		rzStart := span.base() + span.elemsize
		arena.go#L793: 		asanunpoison(unsafe.Pointer(span.base()), span.elemsize)
		arena.go#L889: 	gcController.totalFree.Add(int64(s.elemsize))
		arena.go#L899: 	atomic.Xadd64(&stats.largeFree, int64(s.elemsize))
		arena.go#L903: 	gcController.update(-int64(s.elemsize), 0)
		arena.go#L907: 		racefree(unsafe.Pointer(s.base()), s.elemsize)
		arena.go#L945: 		racefree(unsafe.Pointer(s.base()), s.elemsize)
		arena.go#L948: 		msanfree(unsafe.Pointer(s.base()), s.elemsize)
		arena.go#L951: 		asanpoison(unsafe.Pointer(s.base()), s.elemsize)
		arena.go#L1051: 	s.elemsize -= userArenaChunkReserveBytes()
		arena.go#L1062: 	s.limit = s.base() + s.elemsize
		arena.go#L1066: 		s.elemsize -= redZoneSize(s.elemsize)
		arena.go#L1078: 	atomic.Xadd64(&stats.largeAlloc, int64(s.elemsize))
		arena.go#L1083: 	gcController.totalAlloc.Add(int64(s.elemsize))
		arena.go#L1086: 	gcController.update(int64(s.elemsize), 0)
		arena.go#L1101: 	memclrNoHeapPointers(unsafe.Pointer(s.base()), s.elemsize)
		arena.go#L1107: 	s.userArenaChunkFree = makeAddrRange(base, base+s.elemsize)
		arena.go#L1118: 	s.largeType.Size_ = s.elemsize
		cgocall.go#L729: 			if tp, addr = tp.next(base + span.elemsize); addr == 0 {
		heapdump.go#L485: 		size := s.elemsize
		malloc.go#L939: 			return gclinkptr(uintptr(result)*s.elemsize + s.base())
		malloc.go#L975: 	v = gclinkptr(uintptr(freeIndex)*s.elemsize + s.base())
		malloc.go#L1223: 	c.nextSample -= int64(span.elemsize)
		malloc.go#L1225: 		profilealloc(mp, x, span.elemsize)
		malloc.go#L1249: 		x = add(x, span.elemsize-size)
		malloc.go#L1251: 	return x, span.elemsize
		malloc.go#L1544: 	size = span.elemsize
		mbitmap.go#L157: 	if base == addr && size == span.elemsize {
		mbitmap.go#L182: 	if heapBitsInSpan(span.elemsize) {
		mbitmap.go#L372: 	return span.base() + span.objIndex(addr)*span.elemsize
		mbitmap.go#L543: 	} else if (!s.spanclass.noscan() && heapBitsInSpan(s.elemsize)) || s.isUserArenaChunk {
		mbitmap.go#L570: 		if span.elemsize > minSizeForMallocHeader {
		mbitmap.go#L616: 	bits := span.elemsize / goarch.PtrSize
		mbitmap.go#L674: 	bits := span.elemsize / goarch.PtrSize
		mbitmap.go#L722: 	if doubleCheckHeapSetType && (!heapBitsInSpan(dataSize) || !heapBitsInSpan(span.elemsize)) {
		mbitmap.go#L737: 	return span.elemsize
		mbitmap.go#L747: 	return span.elemsize
		mbitmap.go#L756: 	maxIterBytes := span.elemsize
		mbitmap.go#L782: 	maxIterBytes := span.elemsize
		mbitmap.go#L790: 		if i < span.elemsize {
		mbitmap.go#L799: 			tp, addr = tp.next(x + span.elemsize)
		mbitmap.go#L811: 		tp, addr = tp.next(x + span.elemsize)
		mbitmap.go#L818: 	print("runtime: x=", hex(x), " dataSize=", dataSize, " elemsize=", span.elemsize, "\n")
		mbitmap.go#L820: 	print("runtime: limit=", hex(x+span.elemsize), "\n")
		mbitmap.go#L825: 		if tp, addr = tp.next(x + span.elemsize); addr == 0 {
		mbitmap.go#L847: 		if i < span.elemsize {
		mbitmap.go#L876: 	print("runtime: x=", hex(x), " dataSize=", dataSize, " elemsize=", span.elemsize, " interior=", hex(interior), " size=", size, "\n")
		mbitmap.go#L1138: 	if doubleCheck && q != n/s.elemsize {
		mbitmap.go#L1139: 		println(n, "/", s.elemsize, "should be", n/s.elemsize, "but got", q)
		mbitmap.go#L1302: 	base = s.base() + objIndex*s.elemsize
		mbitmap.go#L1768: 		limit := base + s.elemsize
		mbitmap.go#L1789: 		for i := limit; i < s.elemsize; i++ {
		mcache.go#L175: 		bytesAllocated := slotsUsed * int64(s.elemsize)
		mcache.go#L212: 	usedBytes := uintptr(s.allocCount) * s.elemsize
		mcache.go#L288: 			gcController.totalAlloc.Add(slotsUsed * int64(s.elemsize))
		mcache.go#L296: 				dHeapLive -= int64(s.nelems-s.allocCount) * int64(s.elemsize)
		mfinal.go#L468: 	if !span.spanclass.noscan() && !heapBitsInSpan(span.elemsize) && span.spanclass.sizeclass() != 0 {
		mgcmark.go#L391: 					p := s.base() + uintptr(spf.special.offset)/s.elemsize*s.elemsize
		mgcmark.go#L1394: 	n := s.elemsize
		mgcmark.go#L1414: 			for oblet := b + maxObletBytes; oblet < s.base()+s.elemsize; oblet += maxObletBytes {
		mgcmark.go#L1424: 		n = s.base() + s.elemsize - b
		mgcmark.go#L1561: 		obj := span.base() + idx*span.elemsize
		mgcmark.go#L1621: 			gcw.bytesMarked += uint64(span.elemsize)
		mgcmark.go#L1646: 	print(" s.base()=", hex(s.base()), " s.limit=", hex(s.limit), " s.spanclass=", s.spanclass, " s.elemsize=", s.elemsize, " s.state=")
		mgcmark.go#L1654: 	size := s.elemsize
		mgcmark.go#L1711: 	gcw.bytesMarked += uint64(span.elemsize)
		mgcsweep.go#L527: 	size := s.elemsize
		mgcsweep.go#L616: 				x := s.base() + i*s.elemsize
		mgcsweep.go#L676: 		getg().m.p.ptr().trace.reclaimed += uintptr(nfreed) * s.elemsize
		mgcsweep.go#L762: 			gcController.totalFree.Add(int64(nfreed) * int64(s.elemsize))
		mgcsweep.go#L845: 	print("runtime: marked free object in span ", s, ", elemsize=", s.elemsize, " freeindex=", s.freeindex, " (bad use of unsafe.Pointer or having race conditions? try -d=checkptr or -race)\n")
		mgcsweep.go#L849: 		addr := s.base() + i*s.elemsize
		mgcsweep.go#L868: 			length := s.elemsize
		mheap.go#L490: 	elemsize              uintptr       // computed from sizeclass or from npages
		mheap.go#L504: 	size = s.elemsize
		mheap.go#L1407: 			s.elemsize = nbytes
		mheap.go#L1411: 			s.elemsize = uintptr(class_to_size[sizeclass])
		mheap.go#L1412: 			if !s.spanclass.noscan() && heapBitsInSpan(s.elemsize) {
		mheap.go#L1414: 				s.nelems = uint16((nbytes - (nbytes / goarch.PtrSize / 8)) / s.elemsize)
		mheap.go#L1416: 				s.nelems = uint16(nbytes / s.elemsize)
		mheap.go#L1429: 		s.limit = s.base() + uintptr(s.elemsize)*uintptr(s.nelems)
		mheap.go#L1717: 	span.elemsize = 0
		mwbbuf.go#L259: 			gcw.bytesMarked += uint64(span.elemsize)
		pinner.go#L183: 				offset := objIndex * span.elemsize
		pinner.go#L197: 					offset := objIndex * span.elemsize
		pinner.go#L370: 	offset := objIndex * span.elemsize
		stack.go#L210: 		s.elemsize = fixedStack << order
		stack.go#L211: 		for i := uintptr(0); i < _StackCacheSize; i += s.elemsize {
		stack.go#L413: 			s.elemsize = uintptr(n)
		traceallocfree.go#L69: 				x := s.base() + i*s.elemsize